Complements of connected hypersurfaces in S4
نویسندگان
چکیده
منابع مشابه
Critical graphs with connected complements
We show that given any vertex x of a k-colour-critical graph G with a connected complement, the graph G − x can be (k − 1)-coloured so that every colour class contains at least 2 vertices. This extends the well-known theorem of Gallai, that a k-colour-critical graph with a connected complement has at least 2k − 1 vertices. Our proof does not use matching theory. It is considerably shorter, conc...
متن کاملSmooth Surfaces with Non-simply-connected Complements
We give two constructions of surfaces in simply-connected 4-manifolds with non simply-connected complements. One is an iteration of the twisted rim surgery introduced by the first author [7]. We also construct, for any group G satisfying some simple conditions, a simply-connected symplectic manifold containing a symplectic surface whose complement has fundamental group G. In each case, we produ...
متن کاملHypersurfaces of Low Degree Are Rationally Simply-connected
For a general hypersurface of degree d in projective n-space, if n ≥ d the spaces of 2-pointed rational curves on the hypersurface are rationally connected; thus the hypersurfaces are rationally simply connected. This paper proves stronger versions of theorems in [HS05].
متن کاملCharacterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum. A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. Let Gc 1,n and Gc 2,n be the classes of the connected graphs of order n whose complements are bicyclic with exactly two and t...
متن کاملCounting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces
We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees were much larger, e.g., 248832 (for just the non-degenerate roots) via a famous general result of Khovanski. Our bound is sharp, allows real exponents, allows degeneracies, and extends to certain systems of n-variate fewnomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2017
ISSN: 0218-2165,1793-6527
DOI: 10.1142/s0218216517400144